package Solution101_200;

/**
 * @program Leetcode
 * @description:
 * @author: lishangsheng
 * @create: 2019/07/19 10:24
 */
public class Solution122 {
    public int maxProfit(int[] prices) {
        int maxProfit = 0;
        for (int i = 1; i < prices.length; i++) {
            if (prices[i] > prices[i - 1])
                maxProfit += prices[i] - prices[i - 1];
        }
        return maxProfit;
    }
}
